On the Partially Commutative Shuffle Product
نویسندگان
چکیده
Duchamp, G. and D. Krob, On the partially commutative shuffle product, Theoretical Computer Science 96 (1992) 405410. We give recursive formulas that allow us to compute the partially commutative shuffle product of two partially commutative words.
منابع مشابه
The Bar Construction of an E-infinite Algebra
defined by the shuffle of tensors. If the product of A is commutative, then the bar differential is a derivation with respect to the shuffle product so that B(A) is still an associative and commutative differential graded algebra. Unfortunately, in algebraic topology, algebras are usually commutative only up to homotopy: a motivating example is provided by the cochain algebra of a topological s...
متن کاملQuasi-Shuffle Products
Given a locally finite graded set A and a commutative, associative operation on A that adds degrees, we construct a commutative multiplication ∗ on the set of noncommutative polynomials in A which we call a quasi-shuffle product; it can be viewed as a generalization of the shuffle product III . We extend this commutative algebra structure to a Hopf algebra (A, ∗,1); in the case where A is the s...
متن کاملar X iv : m at h / 99 07 17 3 v 1 [ m at h . Q A ] 2 7 Ju l 1 99 9 QUASI - SHUFFLE PRODUCTS
Given a locally finite graded set A and a commutative, associative operation on A that adds degrees, we construct a commutative multiplication ∗ on the set of noncommutative polynomials in A which we call a quasi-shuffle product; it can be viewed as a generalization of the shuffle product x. We extend this commutative algebra structure to a Hopf algebra (A, ∗,∆); in the case where A is the set ...
متن کاملPartially-commutative context-free languages
The paper is about a class of languages that extends context-free languages (CFL) and is stable under shuffle. Specifically, we investigate the class of partially-commutative context-free languages (pc CFL), where non-terminal symbols are commutative according to a binary independence relation, very much like in trace theory. The class has been recently proposed as a robust class subsuming CFL ...
متن کاملOn the algebra of quasi-shuffles
For any commutative algebra R the shuffle product on the tensor module T (R) can be deformed to a new product. It is called the quasi-shuffle algebra, or stuffle algebra, and denoted T q (R). We show that if R is the polynomial algebra, then T q (R) is free for some algebraic structure called Commutative TriDendriform (CTD-algebras). This result is part of a structure theorem for CTD-bialgebras...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 96 شماره
صفحات -
تاریخ انتشار 1992